Search results for "Computational Linguistics"
showing 10 items of 210 documents
On the empirical spectral distribution for certain models related to sample covariance matrices with different correlations
2021
Given [Formula: see text], we study two classes of large random matrices of the form [Formula: see text] where for every [Formula: see text], [Formula: see text] are iid copies of a random variable [Formula: see text], [Formula: see text], [Formula: see text] are two (not necessarily independent) sets of independent random vectors having different covariance matrices and generating well concentrated bilinear forms. We consider two main asymptotic regimes as [Formula: see text]: a standard one, where [Formula: see text], and a slightly modified one, where [Formula: see text] and [Formula: see text] while [Formula: see text] for some [Formula: see text]. Assuming that vectors [Formula: see t…
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Puentes entre la Lingüística computacional y la Psicolingüística
2011
[EN] Cognitive sciences have assumed that there can be relationships between various disciplines such as Philosophy, Linguistics, Anthropology, Artificial Intelligence, or Psychology. This work aims to make explicit these relations between the Psycholinguistics and Computational Linguistics.
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Translingual text mining for identification of language pair phenomena
2016
Translingual Text Mining (TTM) is an innovative technology of natural language processing for building multilingual parallel corpora, processing machine translation, contextual knowledge acquisition, information extraction, query profiling, language modeling, contextual word sensing, creating feature test sets and for variety of other purposes. The Keynote Lecture will discuss opportunities and challenges of this computational technology. In particular, the focus will be made on identification of language pair phenomena and their applications to building holistic language model which is a novel tool for processing machine translation, supporting professional translations, evaluation of tran…
Determination of m¯b/m¯c and m¯b from nf=4 lattice QCD+QED
2021
We extend HPQCD's earlier ${n}_{f}=2+1+1$ lattice-QCD analysis of the ratio of $\overline{\mathrm{MS}}$ masses of the $b$ and $c$ quark to include results from finer lattices (down to 0.03 fm) and a new calculation of QED contributions to the mass ratio. We find that ${\overline{m}}_{b}(\ensuremath{\mu})/{\overline{m}}_{c}(\ensuremath{\mu})=4.586(12)$ at renormalization scale $\ensuremath{\mu}=3\text{ }\text{ }\mathrm{GeV}$. This result is nonperturbative. Combining it with HPQCD's recent lattice $\mathrm{QCD}+\mathrm{QED}$ determination of ${\overline{m}}_{c}(3\text{ }\text{ }\mathrm{GeV})$ gives a new value for the $b$-quark mass: ${\overline{m}}_{b}(3\text{ }\text{ }\mathrm{GeV})=4.513(2…
On P-compatible hybrid identities and hyperidentities
1994
P-compatible identities are built up from terms with a special structure. We investigate a variety defined by a set ofP-compatible hybrid identities and answer the question whether a variety defined by a set ofP-compatible hyperidentities can be solid.
Editorial: Mining Scientific Papers: NLP-enhanced Bibliometrics
2019
International audience
Languages with mismatches
2007
AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…